| 翻訳と辞書 |
| formal calculation ： ウィキペディア英語版 |
formal calculation
In mathematical logic, a formal calculation is a calculation which is ''systematic, but without a rigorous justification''. This means that we are manipulating the symbols in an expression using a generic substitution, without proving that the necessary conditions hold. Essentially, we are interested in the form of an expression, and not necessarily its underlying meaning. This reasoning can either serve as positive evidence that some statement is true, when it is difficult or unnecessary to provide a proof, or as an inspiration for the creation of new (completely rigorous) definitions.
However, this interpretation of the term formal is not universally accepted, and some consider it to mean quite the opposite: A completely rigorous argument, as in formal mathematical logic.
==Examples==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「formal calculation」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|